Kolmogorov complexity – absolute complexity (within a constant, depending on the particular choice of Universal Turing Machine); MML is typically a computable approximation
Minimum description length – an alternative with a possibly different (non-Bayesian) motivation, developed 10 years after MML.